gcd = lambda a, b: a if b == 0 else gcd(b, a % b)
def takeintinput():
arr = input().split()
arr = [int(i) for i in arr]
return arr
def solve():
a, b, c, d = takeintinput()
if a&2==0 and b%2==0 and c%2==0:
print((a+b+c)//2+d//2)
elif a%2==1 and b%2==1 and c%2==1:
print(a//2+b//2+c//2+1+d//2)
elif c%2==0 and a%2==1 and b%2==1:
print(a//2+b//2+c//2+d//2)
elif c%2==1 and a%2==0 and b%2==0:
print(a//2+b//2+c//2+d//2)
else:
print(a//2+b//2+c//2+d//2)
for i in range(int(input())):
solve()
214A - System of Equations | 287A - IQ Test |
1108A - Two distinct points | 1064A - Make a triangle |
1245C - Constanze's Machine | 1005A - Tanya and Stairways |
1663F - In Every Generation | 1108B - Divisors of Two Integers |
1175A - From Hero to Zero | 1141A - Game 23 |
1401B - Ternary Sequence | 598A - Tricky Sum |
519A - A and B and Chess | 725B - Food on the Plane |
154B - Colliders | 127B - Canvas Frames |
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |